HybridSLAM: Combining FastSLAM and EKF-SLAM for Reliable Mapping

نویسندگان

  • Alex Brooks
  • Tim Bailey
چکیده

This paper presents HybridSLAM: an approach to SLAM which combines the strengths and avoids the weaknesses of two popular mapping strategies: FastSLAM and EKF-SLAM. FastSLAM is used as a front-end, producing local maps which are periodically fused into an EKF-SLAM back-end. The use of FastSLAM locally avoids linearisation of the vehicle model and provides a high level of robustness to clutter and ambiguous data association. The use of EKF-SLAM globally allows uncertainty to be remembered over long vehicle trajectories, avoiding FastSLAM’s tendency to become over-confident. Extensive trials in randomly-generated simulated environments show that HybridSLAM significantly out-performs either pure approach. The advantages of HybridSLAM are most pronounced in cluttered environments where either pure approach encounters serious difficulty. In addition, the HybridSLAM algorithm is experimentally validated in a real urban environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem With Unknown Data Association

Simultaneous Localization and Mapping (SLAM) is an essential capability for mobile robots exploring unknown environments. The Extended Kalman Filter (EKF) has served as the de-facto approach to SLAM for the last fifteen years. However, EKF-based SLAM algorithms suffer from two well-known shortcomings that complicate their application to large, real-world environments: quadratic complexity and s...

متن کامل

Simultaneous localization and mapping with unknown data association using fastSLAM

The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two serious deficiencies that prevent it from being applied to large, realword environments: quadratic complexity and sensitivity to failures in data association. FastSLAM, an alternative approach based on the Rao-Blackwellize...

متن کامل

An intelligent UFastSLAM with MCMC move step

This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

متن کامل

EKF SLAM vs. FastSLAM – A Comparison

st , θ ⊤ 0 , θ ⊤ 1 , . . . , θ ⊤ K )⊤ is the state vector. (Note that the superscript t refers to the set of variables at time t.) In general, the complexity of computing such a density grows exponentially with time; to make the computation tractable, the true state is being assumed to be an unobserved Markov process implying that • the true state is conditionally independent of all earlier sta...

متن کامل

An improved FastSLAM framework using soft computing

FastSLAM is a framework for simultaneous localization and mapping (SLAM) using a Rao-Blackwellized particle filter. However, FastSLAM degenerates over time. This degeneracy is due to the fact that a particle set estimating the pose of the robot loses its diversity. One of the main reasons for losing particle diversity in FastSLAM is sample impoverishment. In this case, most of the particle weig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008